Low Complexity Algorithm for Optimal Hard Decoding of Convolutional Codes
نویسندگان
چکیده
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under certain channel conditions, optimum performance is achievable with an order of magnitude in complexity reduction. Besides, additional complexity reduction can be achieved by detecting the frames which have a low probability to be successfully decoded.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملNew optimal hard decoding of convolutional codes with reduced complexity
It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose an optimal hard decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, under ce...
متن کاملOn the Decoding of Certain Generalized Concatenated Convolutional Codes
Concatenated Convolutional Codes Jung-Fu Cheng [email protected] Abstract Two classes of generalized concatenated (GC) codes with convolutional outer codes are studied. The rst class is based on the classical Plotkin ja bjbj construction. A new suboptimal multi-stage soft decision algorithm is proposed and the corresponding performance bounds are obtained. These codes are shown to achieve...
متن کاملReceding horizon decoding of convolutional codes
Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based on analogies with model predictive optimal control, we propose a new iterative method for convolutional decoding that is cheaper to implement than establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002